Local majorities, coalitions and monopolies in graphs: a review
نویسندگان
چکیده
منابع مشابه
Local Majority Voting, Small Coalitions and Controlling Monopolies in Graphs: A Review
This paper provides an overview of recent developments concerning the process of local majority voting in graphs, and its basic properties, from graph theoretic and algorithmic standpoints.
متن کاملOn irreversible dynamic monopolies in general graphs
Consider the following coloring process in a simple directed graph G(V, E) with positive indegrees. Initially, a set S of vertices are white, whereas all the others are black. Thereafter, a black vertex is colored white whenever more than half of its in-neighbors are white. The coloring process ends when no additional vertices can be colored white. If all vertices end up white, we call S an irr...
متن کاملOpen k-monopolies in graphs: complexity and related concepts
Closed monopolies in graphs have a quite long range of applications in several problems related to overcoming failures, since they frequently have some common approaches around the notion of majorities, for instance to consensus problems, diagnosis problems or voting systems. We introduce here open k-monopolies in graphs which are closely related to different parameters in graphs. Given a graph...
متن کاملThe Power of Small Coalitions in Graphs
This paper considers the question of the in uence of a coalition of vertices seeking to gain control or majority in local neighborhoods in a general graph Say that a vertex v is controlled by the coalition M if the majority of its neighbors are fromM We ask how many vertices as a function of jM j can M control in this fashion Upper and lower bounds are provided for this problem as well as for c...
متن کاملOn dynamic monopolies of graphs with general thresholds
Let G be a graph and τ : V (G) → N be an assignment of thresholds to the vertices ofG. A subset of verticesD is said to be dynamic monopoly (or simply dynamo) if the vertices of G can be partitioned into subsets D0,D1, . . . ,Dk such that D0 = D and for any i = 1, . . . , k − 1 each vertex v in Di+1 has at least t(v) neighbors in D0∪ . . .∪Di. Dynamic monopolies are in fact modeling the irrever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00055-x